| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Lorentz.Prelude
Description
Commonly used parts of regular Prelude.
Synopsis
- ($) :: (a -> b) -> a -> b
- (.) :: (b -> c) -> (a -> b) -> a -> c
- type ($) (f :: k -> k1) (a :: k) = f a
- class Eq a
- class Eq a => Ord a
- class Bounded a where
- class Semigroup a where
- class Semigroup a => Monoid a where
- class Generic a
- data Text
- data Either a b
- data Maybe a
- data Proxy (t :: k) :: forall k. k -> Type = Proxy
- fromString :: IsString a => String -> a
- undefined :: HasCallStack => a
- error :: HasCallStack => Text -> a
Documentation
($) :: (a -> b) -> a -> b infixr 0 #
Application operator. This operator is redundant, since ordinary
application (f x) means the same as (f . However, $ x)$ has
low, right-associative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higher-order situations, such as map ($ 0) xszipWith ($) fs xs
Note that ($) is levity-polymorphic in its result type, so that
foo $ True where foo :: Bool -> Int#
is well-typed
type ($) (f :: k -> k1) (a :: k) = f a infixr 2 #
Infix application.
f :: Either String $ Maybe Int = f :: Either String (Maybe Int)
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, == is customarily
expected to implement an equivalence relationship where two values comparing
equal are indistinguishable by "public" functions, with a "public" function
being one not allowing to see implementation details. For example, for a
type representing non-normalised natural numbers modulo 100, a "public"
function doesn't make the difference between 1 and 201. It is expected to
have the following properties:
Instances
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
The Haskell Report defines no laws for Ord. However, <= is customarily
expected to implement a non-strict partial order and have the following
properties:
- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
Note that the following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Instances
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
The class of semigroups (types with an associative binary operation).
Instances should satisfy the associativity law:
Since: base-4.9.0.0
Minimal complete definition
Methods
(<>) :: a -> a -> a infixr 6 #
An associative operation.
Reduce a non-empty list with <>
The default definition should be sufficient, but this can be overridden for efficiency.
stimes :: Integral b => b -> a -> a #
Repeat a value n times.
Given that this works on a Semigroup it is allowed to fail if
you request 0 or fewer repetitions, and the default definition
will do so.
By making this a member of the class, idempotent semigroups
and monoids can upgrade this to execute in O(1) by
picking stimes = or stimesIdempotentstimes =
respectively.stimesIdempotentMonoid
Instances
class Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws:
x
<>mempty= xmempty<>x = xx(<>(y<>z) = (x<>y)<>zSemigrouplaw)mconcat=foldr'(<>)'mempty
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtypes and make those instances
of Monoid, e.g. Sum and Product.
NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.
Minimal complete definition
Methods
Identity of mappend
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = '(<>)'
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
Instances
Representable types of kind *.
This class is derivable in GHC with the DeriveGeneric flag on.
A Generic instance must satisfy the following laws:
from.to≡idto.from≡id
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
The Either type represents values with two possibilities: a value of
type Either a bLeft aRight b
The Either type is sometimes used to represent a value which is
either correct or an error; by convention, the Left constructor is
used to hold an error value and the Right constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
Examples
The type Either String IntString or an Int. The Left constructor can be used only on
Strings, and the Right constructor can be used only on Ints:
>>>let s = Left "foo" :: Either String Int>>>sLeft "foo">>>let n = Right 3 :: Either String Int>>>nRight 3>>>:type ss :: Either String Int>>>:type nn :: Either String Int
The fmap from our Functor instance will ignore Left values, but
will apply the supplied function to values contained in a Right:
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>fmap (*2) sLeft "foo">>>fmap (*2) nRight 6
The Monad instance for Either allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int from a Char, or fail.
>>>import Data.Char ( digitToInt, isDigit )>>>:{let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>:}
The following should work, since both '1' and '2' can be
parsed as Ints.
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleRight 3
But the following should fail overall, since the first operation where
we attempt to parse 'm' as an Int will fail:
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleLeft "parse error"
Instances
| Arbitrary2 Either | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary2 :: Gen a -> Gen b -> Gen (Either a b) # liftShrink2 :: (a -> [a]) -> (b -> [b]) -> Either a b -> [Either a b] # | |
| ToJSON2 Either | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> Either a b -> Value # liftToJSONList2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> [Either a b] -> Value # liftToEncoding2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> Either a b -> Encoding # liftToEncodingList2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> [Either a b] -> Encoding # | |
| FromJSON2 Either | |
Defined in Data.Aeson.Types.FromJSON | |
| Bifunctor Either | Since: base-4.8.0.0 |
| Eq2 Either | Since: base-4.9.0.0 |
| Ord2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] # | |
| Show2 Either | Since: base-4.9.0.0 |
| NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 Either | |
Defined in Data.Hashable.Class | |
| Swapped Either | |
| () :=> (Monad (Either a)) | |
| () :=> (Functor (Either a)) | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| MonadError e (Either e) | |
Defined in Control.Monad.Error.Class | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Functor (Either a) | Since: base-3.0 |
| Applicative (Either e) | Since: base-3.0 |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Traversable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| Arbitrary a => Arbitrary1 (Either a) | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a0 -> Gen (Either a a0) # liftShrink :: (a0 -> [a0]) -> Either a a0 -> [Either a a0] # | |
| ToJSON a => ToJSON1 (Either a) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a0 -> Value) -> ([a0] -> Value) -> Either a a0 -> Value # liftToJSONList :: (a0 -> Value) -> ([a0] -> Value) -> [Either a a0] -> Value # liftToEncoding :: (a0 -> Encoding) -> ([a0] -> Encoding) -> Either a a0 -> Encoding # liftToEncodingList :: (a0 -> Encoding) -> ([a0] -> Encoding) -> [Either a a0] -> Encoding # | |
| FromJSON a => FromJSON1 (Either a) | |
| Eq a => Eq1 (Either a) | Since: base-4.9.0.0 |
| Ord a => Ord1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read a => Read1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] # | |
| Show a => Show1 (Either a) | Since: base-4.9.0.0 |
| MonadFailure (Either a) | |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| Apply (Either a) | |
| Bind (Either a) | |
| PTraversable (Either a) | |
| STraversable (Either a) | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| PFoldable (Either a) | |
| SFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PFunctor (Either a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative (Either e) | |
| PMonad (Either e) | |
| SFunctor (Either a) | |
| SApplicative (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad (Either e) | |
| Generic1 (Either a :: Type -> Type) | |
| IsoHKD (Either a :: Type -> Type) (b :: Type) | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| (Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| Generic (Either a b) | |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| (Lift a, Lift b) => Lift (Either a b) | |
| (Arbitrary a, Arbitrary b) => Arbitrary (Either a b) | |
| (CoArbitrary a, CoArbitrary b) => CoArbitrary (Either a b) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Either a b -> Gen b0 -> Gen b0 # | |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| (ToJSON a, ToJSON b) => ToJSON (Either a b) | |
Defined in Data.Aeson.Types.ToJSON | |
| (FromJSON a, FromJSON b) => FromJSON (Either a b) | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (Buildable' a, Buildable' b) => Buildable' (Either a b) | |
Defined in Fmt.Internal.Generic | |
| (TypeError (DisallowInstance "Either") :: Constraint) => Container (Either a b) | |
Defined in Universum.Container.Class Methods toList :: Either a b -> [Element (Either a b)] # foldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # foldl :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # foldl' :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # elem :: Element (Either a b) -> Either a b -> Bool # maximum :: Either a b -> Element (Either a b) # minimum :: Either a b -> Element (Either a b) # foldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # fold :: Either a b -> Element (Either a b) # foldr' :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # foldr1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # foldl1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # notElem :: Element (Either a b) -> Either a b -> Bool # all :: (Element (Either a b) -> Bool) -> Either a b -> Bool # any :: (Element (Either a b) -> Bool) -> Either a b -> Bool # find :: (Element (Either a b) -> Bool) -> Either a b -> Maybe (Element (Either a b)) # | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
| PSemigroup (Either a b) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| (SEq a, SEq b) => SEq (Either a b) | |
| PEq (Either a b) | |
| (IsoValue l, IsoValue r) => IsoValue (Either l r) Source # | |
| PolyTypeHasDocC (l ': (r ': ([] :: [Type]))) => TypeHasDoc (Either l r) Source # | |
Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (Either l r) -> Text Source # typeDocMdDescription :: Builder Source # typeDocMdReference :: Proxy (Either l r) -> WithinParens -> Builder Source # typeDocDependencies :: Proxy (Either l r) -> [SomeTypeWithDoc] Source # typeDocHaskellRep :: TypeDocHaskellRep (Either l r) Source # typeDocMichelsonRep :: TypeDocMichelsonRep (Either l r) Source # | |
| (Eq a, Eq b) :=> (Eq (Either a b)) | |
| (Ord a, Ord b) :=> (Ord (Either a b)) | |
| (Read a, Read b) :=> (Read (Either a b)) | |
| (Show a, Show b) :=> (Show (Either a b)) | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621680737577 b6989586621680737578] [b6989586621680737578] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621680737575 b6989586621680737576] ([a6989586621680737575], [b6989586621680737576]) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621680737579 b6989586621680737580] [a6989586621680737579] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680737571 b6989586621680737572) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680737573 b6989586621680737574) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679849639Sym0 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Either a6989586621679091308 b6989586621679091309 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680616818Sym0 :: TyFun Nat (Either a6989586621679091308 b6989586621679091309 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680054909Sym0 :: TyFun a6989586621679991377 (Either e6989586621680053965 a6989586621679991377) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679091309 (Either a6989586621679091308 b6989586621679091309) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679091308 (Either a6989586621679091308 b6989586621679091309) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680214685ASym0 :: TyFun k1 (Either a6989586621679091308 k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| Showtype a2 => Showtype (Right a2 :: Either a1 b) | |
| Showtype a2 => Showtype (Left a2 :: Either a1 b) | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680616818Sym1 a6989586621680616815 a6989586621679091308 b6989586621679091309 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680055033Sym0 :: TyFun (Either e6989586621680053982 a6989586621679991401) ((a6989586621679991401 ~> Either e6989586621680053982 b6989586621679991402) ~> Either e6989586621680053982 b6989586621679991402) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054921Sym0 :: TyFun (Either e6989586621680053965 (a6989586621679991378 ~> b6989586621679991379)) (Either e6989586621680053965 a6989586621679991378 ~> Either e6989586621680053965 b6989586621679991379) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679849639Sym1 a6989586621679849637 :: TyFun (Either a6989586621679091308 b6989586621679091309) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054739Sym0 :: TyFun a6989586621679991374 (Either a6989586621680053953 b6989586621679991375 ~> Either a6989586621680053953 a6989586621679991374) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680054711Sym0 :: TyFun (a6989586621679991372 ~> b6989586621679991373) (Either a6989586621680053953 a6989586621679991372 ~> Either a6989586621680053953 b6989586621679991373) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621680736101 ~> c6989586621680736102) ((b6989586621680736103 ~> c6989586621680736102) ~> (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054921Sym1 a6989586621680054919 :: TyFun (Either e6989586621680053965 a6989586621679991378) (Either e6989586621680053965 b6989586621679991379) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054739Sym1 a6989586621680054737 a6989586621680053953 b6989586621679991375 :: TyFun (Either a6989586621680053953 b6989586621679991375) (Either a6989586621680053953 a6989586621679991374) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680054711Sym1 a6989586621680054709 a6989586621680053953 :: TyFun (Either a6989586621680053953 a6989586621679991372) (Either a6989586621680053953 b6989586621679991373) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995208Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Either a6989586621680994586 a6989586621680988985 ~> f6989586621680988984 (Either a6989586621680994586 b6989586621680988986)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680055033Sym1 a6989586621680055031 b6989586621679991402 :: TyFun (a6989586621679991401 ~> Either e6989586621680053982 b6989586621679991402) (Either e6989586621680053982 b6989586621679991402) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621680736137 b6989586621680736103 :: TyFun (b6989586621680736103 ~> c6989586621680736102) (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d b) # | |
| SuppressUnusedWarnings (Traverse_6989586621680995208Sym1 a6989586621680995206 a6989586621680994586 :: TyFun (Either a6989586621680994586 a6989586621680988985) (f6989586621680988984 (Either a6989586621680994586 b6989586621680988986)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621680736138 a6989586621680736137 :: TyFun (Either a6989586621680736101 b6989586621680736103) c6989586621680736102 -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| (Functor f, Functor g) => Functor (Lift Either f g) | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680737938 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680737940 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679849639Sym1 a6989586621679849637 :: TyFun (Either a b) Ordering -> Type) (a6989586621679849638 :: Either a b) | |
| type Apply (Either_Sym2 a6989586621680736138 a6989586621680736137 :: TyFun (Either a b) c -> Type) (a6989586621680736139 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Failure (Either a) | |
Defined in Basement.Monad | |
| type Product (arg :: Either a1 a2) | |
| type Sum (arg :: Either a1 a2) | |
| type Minimum (arg :: Either a1 a2) | |
| type Maximum (arg :: Either a1 a2) | |
| type Length (a2 :: Either a1 a6989586621680754333) | |
| type Null (a2 :: Either a1 a6989586621680754332) | |
| type ToList (arg :: Either a1 a2) | |
| type Fold (arg :: Either a m) | |
| type Pure (a :: k1) | |
| type Fail arg | |
| type Return (arg :: a) | |
| type Sequence (arg :: Either a1 (m a2)) | |
| type SequenceA (arg :: Either a1 (f a2)) | |
| type Elem (arg1 :: a1) (arg2 :: Either a2 a1) | |
| type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type FoldMap (a2 :: a6989586621680754320 ~> k2) (a3 :: Either a1 a6989586621680754320) | |
| type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679991375) | |
| type Fmap (a2 :: a6989586621679991372 ~> b6989586621679991373) (a3 :: Either a1 a6989586621679991372) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Either e a) <* (arg2 :: Either e b) | |
| type (arg1 :: Either e a) *> (arg2 :: Either e b) | |
| type (a1 :: Either e (a6989586621679991378 ~> b6989586621679991379)) <*> (a2 :: Either e a6989586621679991378) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679991378 ~> b6989586621679991379)) <*> (a2 :: Either e a6989586621679991378) = Apply (Apply (TFHelper_6989586621680054921Sym0 :: TyFun (Either e (a6989586621679991378 ~> b6989586621679991379)) (Either e a6989586621679991378 ~> Either e b6989586621679991379) -> Type) a1) a2 | |
| type (arg1 :: Either e a) >> (arg2 :: Either e b) | |
| type (a1 :: Either e a6989586621679991401) >>= (a2 :: a6989586621679991401 ~> Either e b6989586621679991402) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679991401) >>= (a2 :: a6989586621679991401 ~> Either e b6989586621679991402) = Apply (Apply (TFHelper_6989586621680055033Sym0 :: TyFun (Either e a6989586621679991401) ((a6989586621679991401 ~> Either e b6989586621679991402) ~> Either e b6989586621679991402) -> Type) a1) a2 | |
| type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) | |
| type Traverse (a2 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (a3 :: Either a1 a6989586621680988985) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (a3 :: Either a1 a6989586621680988985) = Apply (Apply (Traverse_6989586621680995208Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Either a1 a6989586621680988985 ~> f6989586621680988984 (Either a1 b6989586621680988986)) -> Type) a2) a3 | |
| type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr (a2 :: a6989586621680754321 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680754321) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) | |
| type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1)) | |
| type HKD (Either a :: Type -> Type) (b :: Type) | |
| type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621680737964 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621680737969 :: [Either a b]) | |
| type Apply (Traverse_6989586621680995208Sym1 a6989586621680995206 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680995207 :: Either a2 a1) | |
| type Rep (Either a b) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep (Either a b) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b))) | |
| type Element (Either a b) | |
Defined in Universum.Container.Class | |
| data Sing (c :: Either a b) | |
| type Demote (Either a b) | |
| type ToT (Either l r) Source # | |
Defined in Michelson.Typed.Haskell.Value | |
| type Show_ (arg :: Either a b) | |
| type Sconcat (arg :: NonEmpty (Either a b)) | |
| type ShowList (arg1 :: [Either a b]) arg2 | |
| type (a2 :: Either a1 b) <> (a3 :: Either a1 b) | |
| type Min (arg1 :: Either a b) (arg2 :: Either a b) | |
| type Max (arg1 :: Either a b) (arg2 :: Either a b) | |
| type (arg1 :: Either a b) >= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) > (arg2 :: Either a b) | |
| type (arg1 :: Either a b) <= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) < (arg2 :: Either a b) | |
| type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) | |
| type (x :: Either a b) /= (y :: Either a b) | |
| type (a2 :: Either a1 b1) == (b2 :: Either a1 b1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Either a1 b) a4 | |
| type Apply (Pure_6989586621680054909Sym0 :: TyFun a (Either e6989586621680053965 a) -> Type) (a6989586621680054908 :: a) | |
| type Apply (LeftSym0 :: TyFun a (Either a b6989586621679091309) -> Type) (t6989586621679754464 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a6989586621679091308 b) -> Type) (t6989586621679754466 :: b) | |
| type Apply (Let6989586621680214685ASym0 :: TyFun k1 (Either a6989586621679091308 k1) -> Type) (wild_69895866216802140206989586621680214684 :: k1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621680616818Sym0 :: TyFun Nat (Either a6989586621679091308 b6989586621679091309 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680616815 :: Nat) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680616818Sym0 :: TyFun Nat (Either a6989586621679091308 b6989586621679091309 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680616815 :: Nat) = (ShowsPrec_6989586621680616818Sym1 a6989586621680616815 a6989586621679091308 b6989586621679091309 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Symbol ~> Symbol) -> Type) | |
| type Apply (TFHelper_6989586621680054739Sym0 :: TyFun a6989586621679991374 (Either a6989586621680053953 b6989586621679991375 ~> Either a6989586621680053953 a6989586621679991374) -> Type) (a6989586621680054737 :: a6989586621679991374) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054739Sym0 :: TyFun a6989586621679991374 (Either a6989586621680053953 b6989586621679991375 ~> Either a6989586621680053953 a6989586621679991374) -> Type) (a6989586621680054737 :: a6989586621679991374) = (TFHelper_6989586621680054739Sym1 a6989586621680054737 a6989586621680053953 b6989586621679991375 :: TyFun (Either a6989586621680053953 b6989586621679991375) (Either a6989586621680053953 a6989586621679991374) -> Type) | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621680737944 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679849639Sym0 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Either a6989586621679091308 b6989586621679091309 ~> Ordering) -> Type) (a6989586621679849637 :: Either a6989586621679091308 b6989586621679091309) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679849639Sym0 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Either a6989586621679091308 b6989586621679091309 ~> Ordering) -> Type) (a6989586621679849637 :: Either a6989586621679091308 b6989586621679091309) = Compare_6989586621679849639Sym1 a6989586621679849637 | |
| type Apply (Fmap_6989586621680054711Sym0 :: TyFun (a6989586621679991372 ~> b6989586621679991373) (Either a6989586621680053953 a6989586621679991372 ~> Either a6989586621680053953 b6989586621679991373) -> Type) (a6989586621680054709 :: a6989586621679991372 ~> b6989586621679991373) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680054711Sym0 :: TyFun (a6989586621679991372 ~> b6989586621679991373) (Either a6989586621680053953 a6989586621679991372 ~> Either a6989586621680053953 b6989586621679991373) -> Type) (a6989586621680054709 :: a6989586621679991372 ~> b6989586621679991373) = (Fmap_6989586621680054711Sym1 a6989586621680054709 a6989586621680053953 :: TyFun (Either a6989586621680053953 a6989586621679991372) (Either a6989586621680053953 b6989586621679991373) -> Type) | |
| type Apply (TFHelper_6989586621680054921Sym0 :: TyFun (Either e6989586621680053965 (a6989586621679991378 ~> b6989586621679991379)) (Either e6989586621680053965 a6989586621679991378 ~> Either e6989586621680053965 b6989586621679991379) -> Type) (a6989586621680054919 :: Either e6989586621680053965 (a6989586621679991378 ~> b6989586621679991379)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054921Sym0 :: TyFun (Either e6989586621680053965 (a6989586621679991378 ~> b6989586621679991379)) (Either e6989586621680053965 a6989586621679991378 ~> Either e6989586621680053965 b6989586621679991379) -> Type) (a6989586621680054919 :: Either e6989586621680053965 (a6989586621679991378 ~> b6989586621679991379)) = TFHelper_6989586621680054921Sym1 a6989586621680054919 | |
| type Apply (ShowsPrec_6989586621680616818Sym1 a6989586621680616815 a6989586621679091308 b6989586621679091309 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Symbol ~> Symbol) -> Type) (a6989586621680616816 :: Either a6989586621679091308 b6989586621679091309) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680616818Sym1 a6989586621680616815 a6989586621679091308 b6989586621679091309 :: TyFun (Either a6989586621679091308 b6989586621679091309) (Symbol ~> Symbol) -> Type) (a6989586621680616816 :: Either a6989586621679091308 b6989586621679091309) = ShowsPrec_6989586621680616818Sym2 a6989586621680616815 a6989586621680616816 | |
| type Apply (TFHelper_6989586621680055033Sym0 :: TyFun (Either e6989586621680053982 a6989586621679991401) ((a6989586621679991401 ~> Either e6989586621680053982 b6989586621679991402) ~> Either e6989586621680053982 b6989586621679991402) -> Type) (a6989586621680055031 :: Either e6989586621680053982 a6989586621679991401) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680055033Sym0 :: TyFun (Either e6989586621680053982 a6989586621679991401) ((a6989586621679991401 ~> Either e6989586621680053982 b6989586621679991402) ~> Either e6989586621680053982 b6989586621679991402) -> Type) (a6989586621680055031 :: Either e6989586621680053982 a6989586621679991401) = (TFHelper_6989586621680055033Sym1 a6989586621680055031 b6989586621679991402 :: TyFun (a6989586621679991401 ~> Either e6989586621680053982 b6989586621679991402) (Either e6989586621680053982 b6989586621679991402) -> Type) | |
| type Apply (Either_Sym0 :: TyFun (a6989586621680736101 ~> c6989586621680736102) ((b6989586621680736103 ~> c6989586621680736102) ~> (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102)) -> Type) (a6989586621680736137 :: a6989586621680736101 ~> c6989586621680736102) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621680736101 ~> c6989586621680736102) ((b6989586621680736103 ~> c6989586621680736102) ~> (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102)) -> Type) (a6989586621680736137 :: a6989586621680736101 ~> c6989586621680736102) = (Either_Sym1 a6989586621680736137 b6989586621680736103 :: TyFun (b6989586621680736103 ~> c6989586621680736102) (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102) -> Type) | |
| type Apply (Fmap_6989586621680054711Sym1 a6989586621680054709 a1 :: TyFun (Either a1 a2) (Either a1 b) -> Type) (a6989586621680054710 :: Either a1 a2) | |
| type Apply (TFHelper_6989586621680054739Sym1 a6989586621680054737 a1 b :: TyFun (Either a1 b) (Either a1 a2) -> Type) (a6989586621680054738 :: Either a1 b) | |
| type Apply (TFHelper_6989586621680054921Sym1 a6989586621680054919 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680054920 :: Either e a) | |
| type Apply (TFHelper_6989586621680055033Sym1 a6989586621680055031 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680055032 :: a ~> Either e b) | |
| type Apply (Traverse_6989586621680995208Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Either a6989586621680994586 a6989586621680988985 ~> f6989586621680988984 (Either a6989586621680994586 b6989586621680988986)) -> Type) (a6989586621680995206 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995208Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Either a6989586621680994586 a6989586621680988985 ~> f6989586621680988984 (Either a6989586621680994586 b6989586621680988986)) -> Type) (a6989586621680995206 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) = (Traverse_6989586621680995208Sym1 a6989586621680995206 a6989586621680994586 :: TyFun (Either a6989586621680994586 a6989586621680988985) (f6989586621680988984 (Either a6989586621680994586 b6989586621680988986)) -> Type) | |
| type Apply (Either_Sym1 a6989586621680736137 b6989586621680736103 :: TyFun (b6989586621680736103 ~> c6989586621680736102) (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102) -> Type) (a6989586621680736138 :: b6989586621680736103 ~> c6989586621680736102) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621680736137 b6989586621680736103 :: TyFun (b6989586621680736103 ~> c6989586621680736102) (Either a6989586621680736101 b6989586621680736103 ~> c6989586621680736102) -> Type) (a6989586621680736138 :: b6989586621680736103 ~> c6989586621680736102) = Either_Sym2 a6989586621680736137 a6989586621680736138 | |
| type Eval (Map f (Right a3 :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Map f (Left x :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Bimap f g (Right y :: Either a b1) :: Either a' b2 -> Type) | |
| type Eval (Bimap f g (Left x :: Either a1 b) :: Either a2 b' -> Type) | |
The Maybe type encapsulates an optional value. A value of type
Maybe aa (represented as Just aNothing). Using Maybe is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error.
The Maybe type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing. A richer
error monad can be built using the Either type.
Instances
| Monad Maybe | Since: base-2.1 |
| Functor Maybe | Since: base-2.1 |
| MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
| Applicative Maybe | Since: base-2.1 |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Traversable Maybe | Since: base-2.1 |
| Arbitrary1 Maybe | |
Defined in Test.QuickCheck.Arbitrary | |
| ToJSON1 Maybe | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding # | |
| FromJSON1 Maybe | |
| Alternative Maybe | Since: base-2.1 |
| MonadPlus Maybe | Since: base-2.1 |
| Eq1 Maybe | Since: base-4.9.0.0 |
| Ord1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 Maybe | Since: base-4.9.0.0 |
| MonadFailure Maybe | |
| NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| Apply Maybe | |
| InjValue Maybe | |
Defined in Named.Internal | |
| Bind Maybe | |
| PTraversable Maybe | |
| STraversable Maybe | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| PFoldable Maybe | |
| SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PFunctor Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative Maybe | |
| PMonad Maybe | |
| PAlternative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PMonadPlus Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SFunctor Maybe | |
| SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad Maybe | |
| SAlternative Maybe | |
| SMonadPlus Maybe | |
| LorentzFunctor Maybe Source # | |
Defined in Lorentz.Instr | |
| MonadError () Maybe | Since: mtl-2.2.2 |
Defined in Control.Monad.Error.Class | |
| (Selector s, GToJSON enc arity (K1 i (Maybe a) :: Type -> Type), KeyValuePair enc pairs, Monoid pairs) => RecordToPairs enc pairs arity (S1 s (K1 i (Maybe a) :: Type -> Type)) | |
Defined in Data.Aeson.Types.ToJSON | |
| () :=> (Functor Maybe) | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Alternative Maybe # | |
| () :=> (MonadPlus Maybe) | |
| (Selector s, FromJSON a) => FromRecord arity (S1 s (K1 i (Maybe a) :: Type -> Type)) | |
Defined in Data.Aeson.Types.FromJSON | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Data a => Data (Maybe a) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # | |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Read a => Read (Maybe a) | Since: base-2.1 |
| Show a => Show (Maybe a) | Since: base-2.1 |
| Generic (Maybe a) | |
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Lift a => Lift (Maybe a) | |
| Arbitrary a => Arbitrary (Maybe a) | |
| CoArbitrary a => CoArbitrary (Maybe a) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Maybe a -> Gen b -> Gen b # | |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| ToJSON a => ToJSON (Maybe a) | |
Defined in Data.Aeson.Types.ToJSON | |
| FromJSON a => FromJSON (Maybe a) | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| Buildable' a => Buildable' (Maybe a) | |
Defined in Fmt.Internal.Generic | |
| Buildable a => Buildable (Maybe a) | |
Defined in Formatting.Buildable | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| At (Maybe a) | |
| (TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a) | |
Defined in Universum.Container.Class Methods toList :: Maybe a -> [Element (Maybe a)] # foldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # foldl' :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # elem :: Element (Maybe a) -> Maybe a -> Bool # maximum :: Maybe a -> Element (Maybe a) # minimum :: Maybe a -> Element (Maybe a) # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # foldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
| PSemigroup (Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Maybe a) | |
| PEq (Maybe a) | |
| IsOption (Maybe AntXMLPath) | |
Defined in Test.Tasty.Runners.AntXML Methods defaultValue :: Maybe AntXMLPath # parseValue :: String -> Maybe (Maybe AntXMLPath) # optionName :: Tagged (Maybe AntXMLPath) String # optionHelp :: Tagged (Maybe AntXMLPath) String # optionCLParser :: Parser (Maybe AntXMLPath) # | |
| Pretty a => Pretty (Maybe a) | |
Defined in Text.PrettyPrint.Leijen.Text | |
| LookupField (Maybe a) | |
| IsoValue a => IsoValue (Maybe a) Source # | |
| PolyTypeHasDocC (a ': ([] :: [Type])) => TypeHasDoc (Maybe a) Source # | |
Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (Maybe a) -> Text Source # typeDocMdDescription :: Builder Source # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Builder Source # typeDocDependencies :: Proxy (Maybe a) -> [SomeTypeWithDoc] Source # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) Source # typeDocMichelsonRep :: TypeDocMichelsonRep (Maybe a) Source # | |
| Generic1 Maybe | |
| IsoHKD Maybe (a :: Type) | |
| SingI (Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| (Eq a) :=> (Eq (Maybe a)) | |
| (Ord a) :=> (Ord (Maybe a)) | |
| (Read a) :=> (Read (Maybe a)) | |
| (Show a) :=> (Show (Maybe a)) | |
| (Semigroup a) :=> (Semigroup (Maybe a)) | |
| (Monoid a) :=> (Monoid (Maybe a)) | |
| Showtype (Nothing :: Maybe a) | |
| Each (Maybe a) (Maybe b) a b | |
| SingI a2 => SingI (Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Showtype a2 => Showtype (Just a2 :: Maybe a1) | |
| (Typeable a, TypeHasDoc (Maybe a), KnownSymbol n) => TypeHasDoc (n :? a) Source # | |
Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (n :? a) -> Text Source # typeDocMdDescription :: Builder Source # typeDocMdReference :: Proxy (n :? a) -> WithinParens -> Builder Source # typeDocDependencies :: Proxy (n :? a) -> [SomeTypeWithDoc] Source # typeDocHaskellRep :: TypeDocHaskellRep (n :? a) Source # typeDocMichelsonRep :: TypeDocMichelsonRep (n :? a) Source # | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621679949662] [a6989586621679949662] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621679949663] (Maybe a6989586621679949663) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680459097] ([a6989586621680459097] ~> Maybe [a6989586621680459097]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621679949664) [a6989586621679949664] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679949667) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679949668) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621679949666) a6989586621679949666 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680055049Sym0 :: TyFun (Maybe a6989586621679991455) (Maybe a6989586621679991455 ~> Maybe a6989586621679991455) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680745324) (MinInternal a6989586621680745324) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680744638) (MaxInternal a6989586621680744638) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679849559Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679054074) (Option a6989586621679054074) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679088945) (Last a6989586621679088945) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679088952) (First a6989586621679088952) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680616764Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fail_6989586621680054956Sym0 :: TyFun Symbol (Maybe a6989586621679991406) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621679949665 (Maybe a6989586621679949665 ~> a6989586621679949665) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680332879 ([a6989586621680332879] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680054749Sym0 :: TyFun a6989586621679991377 (Maybe a6989586621679991377) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680055045LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679054074) (Maybe a6989586621679054074) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679088952) (Maybe a6989586621679088952) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679088945) (Maybe a6989586621679088945) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680332880 ~> Bool) ([a6989586621680332880] ~> Maybe a6989586621680332880) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680332877 ~> Bool) ([a6989586621680332877] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 # | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 # | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621680471807 :: TyFun [a6989586621680459097] (Maybe [a6989586621680459097]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680342437 :: TyFun [a6989586621680332880] (Maybe a6989586621680332880) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621680342797 :: TyFun [a6989586621680332877] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621680342805 :: TyFun [a6989586621680332879] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680616764Sym1 a6989586621680616761 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621679949857 :: TyFun (Maybe a6989586621679949665) a6989586621679949665 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680055049Sym1 a6989586621680055047 :: TyFun (Maybe a6989586621679991455) (Maybe a6989586621679991455) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054949Sym0 :: TyFun (Maybe a6989586621679991403) (Maybe b6989586621679991404 ~> Maybe b6989586621679991404) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054933Sym0 :: TyFun (Maybe a6989586621679991401) ((a6989586621679991401 ~> Maybe b6989586621679991402) ~> Maybe b6989586621679991402) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054791Sym0 :: TyFun (Maybe a6989586621679991383) (Maybe b6989586621679991384 ~> Maybe b6989586621679991384) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679849559Sym1 a6989586621679849557 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054761Sym0 :: TyFun (Maybe (a6989586621679991378 ~> b6989586621679991379)) (Maybe a6989586621679991378 ~> Maybe b6989586621679991379) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621679948228 ((a6989586621679948229 ~> b6989586621679948228) ~> (Maybe a6989586621679948229 ~> b6989586621679948228)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680332858 ([(a6989586621680332858, b6989586621680332859)] ~> Maybe b6989586621680332859) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054620Sym0 :: TyFun a6989586621679991374 (Maybe b6989586621679991375 ~> Maybe a6989586621679991374) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746129NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746129MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746102NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746102MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621679949660 ~> Maybe b6989586621679949661) ([a6989586621679949660] ~> [b6989586621679949661]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680332936 ~> Maybe (a6989586621680332937, b6989586621680332936)) (b6989586621680332936 ~> [a6989586621680332937]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680054600Sym0 :: TyFun (a6989586621679991372 ~> b6989586621679991373) (Maybe a6989586621679991372 ~> Maybe b6989586621679991373) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680754226 ~> Bool) (t6989586621680754225 a6989586621680754226 ~> Maybe a6989586621680754226) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 # | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 # | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (LookupSym1 a6989586621680342219 b6989586621680332859 :: TyFun [(a6989586621680332858, b6989586621680332859)] (Maybe b6989586621680332859) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054949Sym1 a6989586621680054947 b6989586621679991404 :: TyFun (Maybe b6989586621679991404) (Maybe b6989586621679991404) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054791Sym1 a6989586621680054789 b6989586621679991384 :: TyFun (Maybe b6989586621679991384) (Maybe b6989586621679991384) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054761Sym1 a6989586621680054759 :: TyFun (Maybe a6989586621679991378) (Maybe b6989586621679991379) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054620Sym1 a6989586621680054618 b6989586621679991375 :: TyFun (Maybe b6989586621679991375) (Maybe a6989586621679991374) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680054600Sym1 a6989586621680054598 :: TyFun (Maybe a6989586621679991372) (Maybe b6989586621679991373) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746129NSym1 x6989586621680746127 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746129MSym1 x6989586621680746127 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746102NSym1 x6989586621680746100 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680746102MSym1 x6989586621680746100 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680754683 t6989586621680754225 :: TyFun (t6989586621680754225 a6989586621680754226) (Maybe a6989586621680754226) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680658710Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680658622Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995167Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Maybe a6989586621680988985 ~> f6989586621680988984 (Maybe b6989586621680988986)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621679948246 a6989586621679948229 :: TyFun (a6989586621679948229 ~> b6989586621679948228) (Maybe a6989586621679948229 ~> b6989586621679948228) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679949834RsSym0 :: TyFun (a6989586621679949660 ~> Maybe k1) (TyFun k (TyFun [a6989586621679949660] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680054933Sym1 a6989586621680054931 b6989586621679991402 :: TyFun (a6989586621679991401 ~> Maybe b6989586621679991402) (Maybe b6989586621679991402) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680054777Sym0 :: TyFun (a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) (Maybe a6989586621679991380 ~> (Maybe b6989586621679991381 ~> Maybe c6989586621679991382)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755160MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755135MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d b) # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) # | |
| SuppressUnusedWarnings (Traverse_6989586621680995167Sym1 a6989586621680995165 :: TyFun (Maybe a6989586621680988985) (f6989586621680988984 (Maybe b6989586621680988986)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621679948247 a6989586621679948246 :: TyFun (Maybe a6989586621679948229) b6989586621679948228 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680054777Sym1 a6989586621680054774 :: TyFun (Maybe a6989586621679991380) (Maybe b6989586621679991381 ~> Maybe c6989586621679991382) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755160MfSym1 f6989586621680755158 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755135MfSym1 f6989586621680755133 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680658710Sym1 a6989586621680658708 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680658622Sym1 a6989586621680658620 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (LiftA2_6989586621680054777Sym2 a6989586621680054775 a6989586621680054774 :: TyFun (Maybe b6989586621679991381) (Maybe c6989586621679991382) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755160MfSym2 xs6989586621680755159 f6989586621680755158 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755135MfSym2 xs6989586621680755134 f6989586621680755133 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680658710Sym2 k6989586621680658709 a6989586621680658708 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680658622Sym2 k6989586621680658621 a6989586621680658620 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755135MfSym3 a6989586621680755136 xs6989586621680755134 f6989586621680755133 :: TyFun (Maybe k2) (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680755160MfSym3 a6989586621680755161 xs6989586621680755159 f6989586621680755158 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| ToJSON a => ToJSON (NamedF Maybe a name) Source # | |
| FromJSON a => FromJSON (NamedF Maybe a name) Source # | |
| Wrapped (NamedF Maybe a name) Source # | |
| IsoValue a => IsoValue (NamedF Maybe a name) Source # | |
| type Failure Maybe | |
Defined in Basement.Monad | |
| type Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Product (arg :: Maybe a) | |
| type Sum (arg :: Maybe a) | |
| type Minimum (arg :: Maybe a) | |
| type Maximum (arg :: Maybe a) | |
| type Length (arg :: Maybe a) | |
| type Null (arg :: Maybe a) | |
| type ToList (arg :: Maybe a) | |
| type Fold (arg :: Maybe m) | |
| type Pure (a :: k1) | |
| type Fail a2 | |
| type Return (arg :: a) | |
| type Sequence (arg :: Maybe (m a)) | |
| type SequenceA (arg :: Maybe (f a)) | |
| type Elem (arg1 :: a) (arg2 :: Maybe a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type (a1 :: Maybe a6989586621679991455) <|> (a2 :: Maybe a6989586621679991455) | |
| type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type FoldMap (a1 :: a6989586621680754320 ~> k2) (a2 :: Maybe a6989586621680754320) | |
| type (a1 :: k1) <$ (a2 :: Maybe b6989586621679991375) | |
| type Fmap (a1 :: a6989586621679991372 ~> b6989586621679991373) (a2 :: Maybe a6989586621679991372) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
| type (a1 :: Maybe a6989586621679991383) *> (a2 :: Maybe b6989586621679991384) | |
| type (a1 :: Maybe (a6989586621679991378 ~> b6989586621679991379)) <*> (a2 :: Maybe a6989586621679991378) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (a1 :: Maybe a6989586621679991403) >> (a2 :: Maybe b6989586621679991404) | |
| type (a1 :: Maybe a6989586621679991401) >>= (a2 :: a6989586621679991401 ~> Maybe b6989586621679991402) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
| type Traverse (a1 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (a2 :: Maybe a6989586621680988985) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (a2 :: Maybe a6989586621680988985) = Apply (Apply (Traverse_6989586621680995167Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Maybe a6989586621680988985 ~> f6989586621680988984 (Maybe b6989586621680988986)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldl (a1 :: k2 ~> (a6989586621680754326 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680754326) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldr (a1 :: a6989586621680754321 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680754321) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (a1 :: a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) (a2 :: Maybe a6989586621679991380) (a3 :: Maybe b6989586621679991381) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) (a2 :: Maybe a6989586621679991380) (a3 :: Maybe b6989586621679991381) = Apply (Apply (Apply (LiftA2_6989586621680054777Sym0 :: TyFun (a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) (Maybe a6989586621679991380 ~> (Maybe b6989586621679991381 ~> Maybe c6989586621679991382)) -> Type) a1) a2) a3 | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679949870 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679949872 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679949867 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Compare_6989586621679849559Sym1 a6989586621679849557 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679849558 :: Maybe a) | |
| type Apply (FromMaybeSym1 a6989586621679949857 :: TyFun (Maybe a) a -> Type) (a6989586621679949858 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Maybe_Sym2 a6989586621679948247 a6989586621679948246 :: TyFun (Maybe a) b -> Type) (a6989586621679948248 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Rep (Maybe a) | Since: base-4.6.0.0 |
| data Sing (b :: Maybe a) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type Element (Maybe a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| data Sing (b :: Maybe a) | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type ToT (Maybe a) Source # | |
Defined in Michelson.Typed.Haskell.Value | |
| type Rep1 Maybe | Since: base-4.6.0.0 |
| type Mconcat (arg :: [Maybe a]) | |
| type Show_ (arg :: Maybe a) | |
| type Sconcat (arg :: NonEmpty (Maybe a)) | |
| type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type ShowList (arg1 :: [Maybe a]) arg2 | |
| type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
| type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
| type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
| type (x :: Maybe a) /= (y :: Maybe a) | |
| type (a2 :: Maybe a1) == (b :: Maybe a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type HKD Maybe (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
| type Apply (Pure_6989586621680054749Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680054748 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Fail_6989586621680054956Sym0 :: TyFun Symbol (Maybe a6989586621679991406) -> Type) (a6989586621680054955 :: Symbol) | |
| type Apply (Let6989586621680055045LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800539946989586621680055044 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679754397 :: a) | |
| type Apply (Let6989586621680746102MSym1 x6989586621680746100 :: TyFun k (Maybe k1) -> Type) (y6989586621680746101 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680746102NSym1 x6989586621680746100 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680746101 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680746129MSym1 x6989586621680746127 :: TyFun k (Maybe k1) -> Type) (y6989586621680746128 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680746129NSym1 x6989586621680746127 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680746128 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680658622Sym2 k6989586621680658621 a6989586621680658620 :: TyFun k1 (Maybe a) -> Type) (t6989586621680658633 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680658710Sym2 k6989586621680658709 a6989586621680658708 :: TyFun k1 (Maybe a) -> Type) (t6989586621680658721 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680755160MfSym3 a6989586621680755161 xs6989586621680755159 f6989586621680755158 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680755162 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679949846 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679949854 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679949854 :: Maybe a) = MaybeToList a6989586621679949854 | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679949851 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679949851 :: [a]) = ListToMaybe a6989586621679949851 | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680223684 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680652518 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680652539 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680223687 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680652521 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680652542 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680745523 :: Maybe a) | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680745316 :: Maybe a) | |
| type Apply (StripPrefixSym1 a6989586621680471807 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680471808 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680471807 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680471808 :: [a]) = StripPrefix a6989586621680471807 a6989586621680471808 | |
| type Apply (FindIndexSym1 a6989586621680342797 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680342798 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemIndexSym1 a6989586621680342805 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680342806 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindSym1 a6989586621680342437 :: TyFun [a] (Maybe a) -> Type) (a6989586621680342438 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (TFHelper_6989586621680055049Sym1 a6989586621680055047 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680055048 :: Maybe a) | |
| type Apply (LookupSym1 a6989586621680342219 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680342220 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Fmap_6989586621680054600Sym1 a6989586621680054598 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680054599 :: Maybe a) | |
| type Apply (TFHelper_6989586621680054620Sym1 a6989586621680054618 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680054619 :: Maybe b) | |
| type Apply (TFHelper_6989586621680054761Sym1 a6989586621680054759 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680054760 :: Maybe a) | |
| type Apply (TFHelper_6989586621680054791Sym1 a6989586621680054789 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680054790 :: Maybe b) | |
| type Apply (TFHelper_6989586621680054949Sym1 a6989586621680054947 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680054948 :: Maybe b) | |
| type Apply (FindSym1 a6989586621680754683 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680754684 :: t a) | |
| type Apply (Traverse_6989586621680995167Sym1 a6989586621680995165 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680995166 :: Maybe a) | |
| type Apply (LiftA2_6989586621680054777Sym2 a6989586621680054775 a6989586621680054774 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680054776 :: Maybe b) | |
| type Apply (Let6989586621680755135MfSym3 a6989586621680755136 xs6989586621680755134 f6989586621680755133 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680755137 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Eval (Tail (_a ': as) :: Maybe [a] -> Type) | |
| type Eval (Tail ([] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) | |
| type Eval (Head ([] :: [a]) :: Maybe a -> Type) | |
| type Apply (TFHelper_6989586621680054933Sym1 a6989586621680054931 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680054932 :: a ~> Maybe b) | |
| type Eval (FindIndex _p ([] :: [a]) :: Maybe Nat -> Type) | |
| type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) | |
| type Eval (Find _p ([] :: [a]) :: Maybe a -> Type) | |
| type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) | |
| type Eval (Map f (Just a3) :: Maybe a2 -> Type) | |
| type Eval (Map f (Nothing :: Maybe a) :: Maybe b -> Type) | |
| type Apply (ElemIndexSym0 :: TyFun a6989586621680332879 ([a6989586621680332879] ~> Maybe Nat) -> Type) (a6989586621680342805 :: a6989586621680332879) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680332879 ([a6989586621680332879] ~> Maybe Nat) -> Type) (a6989586621680342805 :: a6989586621680332879) = ElemIndexSym1 a6989586621680342805 | |
| type Apply (ShowsPrec_6989586621680616764Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680616761 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (FromMaybeSym0 :: TyFun a6989586621679949665 (Maybe a6989586621679949665 ~> a6989586621679949665) -> Type) (a6989586621679949857 :: a6989586621679949665) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621679949665 (Maybe a6989586621679949665 ~> a6989586621679949665) -> Type) (a6989586621679949857 :: a6989586621679949665) = FromMaybeSym1 a6989586621679949857 | |
| type Apply (Let6989586621680746102MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680746100 :: k1) | |
| type Apply (Let6989586621680746102NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680746100 :: k) | |
| type Apply (Let6989586621680746129MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680746127 :: k1) | |
| type Apply (Let6989586621680746129NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680746127 :: k) | |
| type Apply (LookupSym0 :: TyFun a6989586621680332858 ([(a6989586621680332858, b6989586621680332859)] ~> Maybe b6989586621680332859) -> Type) (a6989586621680342219 :: a6989586621680332858) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680332858 ([(a6989586621680332858, b6989586621680332859)] ~> Maybe b6989586621680332859) -> Type) (a6989586621680342219 :: a6989586621680332858) = (LookupSym1 a6989586621680342219 b6989586621680332859 :: TyFun [(a6989586621680332858, b6989586621680332859)] (Maybe b6989586621680332859) -> Type) | |
| type Apply (TFHelper_6989586621680054620Sym0 :: TyFun a6989586621679991374 (Maybe b6989586621679991375 ~> Maybe a6989586621679991374) -> Type) (a6989586621680054618 :: a6989586621679991374) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054620Sym0 :: TyFun a6989586621679991374 (Maybe b6989586621679991375 ~> Maybe a6989586621679991374) -> Type) (a6989586621680054618 :: a6989586621679991374) = (TFHelper_6989586621680054620Sym1 a6989586621680054618 b6989586621679991375 :: TyFun (Maybe b6989586621679991375) (Maybe a6989586621679991374) -> Type) | |
| type Apply (Maybe_Sym0 :: TyFun b6989586621679948228 ((a6989586621679948229 ~> b6989586621679948228) ~> (Maybe a6989586621679948229 ~> b6989586621679948228)) -> Type) (a6989586621679948246 :: b6989586621679948228) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621679948228 ((a6989586621679948229 ~> b6989586621679948228) ~> (Maybe a6989586621679948229 ~> b6989586621679948228)) -> Type) (a6989586621679948246 :: b6989586621679948228) = (Maybe_Sym1 a6989586621679948246 a6989586621679948229 :: TyFun (a6989586621679948229 ~> b6989586621679948228) (Maybe a6989586621679948229 ~> b6989586621679948228) -> Type) | |
| type Apply (Lambda_6989586621680658622Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680658620 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680658710Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680658708 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680755160MfSym1 f6989586621680755158 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680755159 :: k) | |
| type Apply (Let6989586621680755135MfSym1 f6989586621680755133 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680755134 :: k) | |
| type Apply (Let6989586621680755135MfSym2 xs6989586621680755134 f6989586621680755133 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680755136 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (StripPrefixSym0 :: TyFun [a6989586621680459097] ([a6989586621680459097] ~> Maybe [a6989586621680459097]) -> Type) (a6989586621680471807 :: [a6989586621680459097]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680459097] ([a6989586621680459097] ~> Maybe [a6989586621680459097]) -> Type) (a6989586621680471807 :: [a6989586621680459097]) = StripPrefixSym1 a6989586621680471807 | |
| type Apply (TFHelper_6989586621680055049Sym0 :: TyFun (Maybe a6989586621679991455) (Maybe a6989586621679991455 ~> Maybe a6989586621679991455) -> Type) (a6989586621680055047 :: Maybe a6989586621679991455) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Compare_6989586621679849559Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679849557 :: Maybe a3530822107858468865) | |
| type Apply (TFHelper_6989586621680054761Sym0 :: TyFun (Maybe (a6989586621679991378 ~> b6989586621679991379)) (Maybe a6989586621679991378 ~> Maybe b6989586621679991379) -> Type) (a6989586621680054759 :: Maybe (a6989586621679991378 ~> b6989586621679991379)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054761Sym0 :: TyFun (Maybe (a6989586621679991378 ~> b6989586621679991379)) (Maybe a6989586621679991378 ~> Maybe b6989586621679991379) -> Type) (a6989586621680054759 :: Maybe (a6989586621679991378 ~> b6989586621679991379)) = TFHelper_6989586621680054761Sym1 a6989586621680054759 | |
| type Apply (TFHelper_6989586621680054791Sym0 :: TyFun (Maybe a6989586621679991383) (Maybe b6989586621679991384 ~> Maybe b6989586621679991384) -> Type) (a6989586621680054789 :: Maybe a6989586621679991383) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054791Sym0 :: TyFun (Maybe a6989586621679991383) (Maybe b6989586621679991384 ~> Maybe b6989586621679991384) -> Type) (a6989586621680054789 :: Maybe a6989586621679991383) = (TFHelper_6989586621680054791Sym1 a6989586621680054789 b6989586621679991384 :: TyFun (Maybe b6989586621679991384) (Maybe b6989586621679991384) -> Type) | |
| type Apply (TFHelper_6989586621680054949Sym0 :: TyFun (Maybe a6989586621679991403) (Maybe b6989586621679991404 ~> Maybe b6989586621679991404) -> Type) (a6989586621680054947 :: Maybe a6989586621679991403) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054949Sym0 :: TyFun (Maybe a6989586621679991403) (Maybe b6989586621679991404 ~> Maybe b6989586621679991404) -> Type) (a6989586621680054947 :: Maybe a6989586621679991403) = (TFHelper_6989586621680054949Sym1 a6989586621680054947 b6989586621679991404 :: TyFun (Maybe b6989586621679991404) (Maybe b6989586621679991404) -> Type) | |
| type Apply (ShowsPrec_6989586621680616764Sym1 a6989586621680616761 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680616762 :: Maybe a3530822107858468865) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (TFHelper_6989586621680054933Sym0 :: TyFun (Maybe a6989586621679991401) ((a6989586621679991401 ~> Maybe b6989586621679991402) ~> Maybe b6989586621679991402) -> Type) (a6989586621680054931 :: Maybe a6989586621679991401) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680054933Sym0 :: TyFun (Maybe a6989586621679991401) ((a6989586621679991401 ~> Maybe b6989586621679991402) ~> Maybe b6989586621679991402) -> Type) (a6989586621680054931 :: Maybe a6989586621679991401) = (TFHelper_6989586621680054933Sym1 a6989586621680054931 b6989586621679991402 :: TyFun (a6989586621679991401 ~> Maybe b6989586621679991402) (Maybe b6989586621679991402) -> Type) | |
| type Apply (LiftA2_6989586621680054777Sym1 a6989586621680054774 :: TyFun (Maybe a6989586621679991380) (Maybe b6989586621679991381 ~> Maybe c6989586621679991382) -> Type) (a6989586621680054775 :: Maybe a6989586621679991380) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680755160MfSym2 xs6989586621680755159 f6989586621680755158 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680755161 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (FindSym0 :: TyFun (a6989586621680332880 ~> Bool) ([a6989586621680332880] ~> Maybe a6989586621680332880) -> Type) (a6989586621680342437 :: a6989586621680332880 ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680332877 ~> Bool) ([a6989586621680332877] ~> Maybe Nat) -> Type) (a6989586621680342797 :: a6989586621680332877 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MapMaybeSym0 :: TyFun (a6989586621679949660 ~> Maybe b6989586621679949661) ([a6989586621679949660] ~> [b6989586621679949661]) -> Type) (a6989586621679949827 :: a6989586621679949660 ~> Maybe b6989586621679949661) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621679949660 ~> Maybe b6989586621679949661) ([a6989586621679949660] ~> [b6989586621679949661]) -> Type) (a6989586621679949827 :: a6989586621679949660 ~> Maybe b6989586621679949661) = MapMaybeSym1 a6989586621679949827 | |
| type Apply (Fmap_6989586621680054600Sym0 :: TyFun (a6989586621679991372 ~> b6989586621679991373) (Maybe a6989586621679991372 ~> Maybe b6989586621679991373) -> Type) (a6989586621680054598 :: a6989586621679991372 ~> b6989586621679991373) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (UnfoldrSym0 :: TyFun (b6989586621680332936 ~> Maybe (a6989586621680332937, b6989586621680332936)) (b6989586621680332936 ~> [a6989586621680332937]) -> Type) (a6989586621680342870 :: b6989586621680332936 ~> Maybe (a6989586621680332937, b6989586621680332936)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680332936 ~> Maybe (a6989586621680332937, b6989586621680332936)) (b6989586621680332936 ~> [a6989586621680332937]) -> Type) (a6989586621680342870 :: b6989586621680332936 ~> Maybe (a6989586621680332937, b6989586621680332936)) = UnfoldrSym1 a6989586621680342870 | |
| type Apply (FindSym0 :: TyFun (a6989586621680754226 ~> Bool) (t6989586621680754225 a6989586621680754226 ~> Maybe a6989586621680754226) -> Type) (a6989586621680754683 :: a6989586621680754226 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680754226 ~> Bool) (t6989586621680754225 a6989586621680754226 ~> Maybe a6989586621680754226) -> Type) (a6989586621680754683 :: a6989586621680754226 ~> Bool) = (FindSym1 a6989586621680754683 t6989586621680754225 :: TyFun (t6989586621680754225 a6989586621680754226) (Maybe a6989586621680754226) -> Type) | |
| type Apply (Let6989586621679949834RsSym0 :: TyFun (a6989586621679949660 ~> Maybe k1) (TyFun k (TyFun [a6989586621679949660] [k1] -> Type) -> Type) -> Type) (f6989586621679949831 :: a6989586621679949660 ~> Maybe k1) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679949834RsSym0 :: TyFun (a6989586621679949660 ~> Maybe k1) (TyFun k (TyFun [a6989586621679949660] [k1] -> Type) -> Type) -> Type) (f6989586621679949831 :: a6989586621679949660 ~> Maybe k1) = (Let6989586621679949834RsSym1 f6989586621679949831 :: TyFun k (TyFun [a6989586621679949660] [k1] -> Type) -> Type) | |
| type Apply (Let6989586621680755135MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680755133 :: k3 ~> (k2 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680755135MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680755133 :: k3 ~> (k2 ~> k3)) = (Let6989586621680755135MfSym1 f6989586621680755133 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680755160MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680755158 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680755160MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680755158 :: k2 ~> (k3 ~> k3)) = (Let6989586621680755160MfSym1 f6989586621680755158 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
| type Apply (Traverse_6989586621680995167Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Maybe a6989586621680988985 ~> f6989586621680988984 (Maybe b6989586621680988986)) -> Type) (a6989586621680995165 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995167Sym0 :: TyFun (a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) (Maybe a6989586621680988985 ~> f6989586621680988984 (Maybe b6989586621680988986)) -> Type) (a6989586621680995165 :: a6989586621680988985 ~> f6989586621680988984 b6989586621680988986) = Traverse_6989586621680995167Sym1 a6989586621680995165 | |
| type Apply (Maybe_Sym1 a6989586621679948246 a6989586621679948229 :: TyFun (a6989586621679948229 ~> b6989586621679948228) (Maybe a6989586621679948229 ~> b6989586621679948228) -> Type) (a6989586621679948247 :: a6989586621679948229 ~> b6989586621679948228) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679948246 a6989586621679948229 :: TyFun (a6989586621679948229 ~> b6989586621679948228) (Maybe a6989586621679948229 ~> b6989586621679948228) -> Type) (a6989586621679948247 :: a6989586621679948229 ~> b6989586621679948228) = Maybe_Sym2 a6989586621679948246 a6989586621679948247 | |
| type Apply (LiftA2_6989586621680054777Sym0 :: TyFun (a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) (Maybe a6989586621679991380 ~> (Maybe b6989586621679991381 ~> Maybe c6989586621679991382)) -> Type) (a6989586621680054774 :: a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680054777Sym0 :: TyFun (a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) (Maybe a6989586621679991380 ~> (Maybe b6989586621679991381 ~> Maybe c6989586621679991382)) -> Type) (a6989586621680054774 :: a6989586621679991380 ~> (b6989586621679991381 ~> c6989586621679991382)) = LiftA2_6989586621680054777Sym1 a6989586621680054774 | |
| type Apply (Lambda_6989586621680658622Sym1 a6989586621680658620 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680658621 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680658710Sym1 a6989586621680658708 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680658709 :: k1 ~> Last a) | |
| type Unwrapped (NamedF Maybe a name) Source # | |
Defined in Util.Named | |
| type ToT (NamedF Maybe a name) Source # | |
data Proxy (t :: k) :: forall k. k -> Type #
Proxy is a type that holds no data, but has a phantom parameter of
arbitrary type (or even kind). Its use is to provide type information, even
though there is no value available of that type (or it may be too costly to
create one).
Historically, Proxy :: Proxy a'undefined :: a' idiom.
>>>Proxy :: Proxy (Void, Int -> Int)Proxy
Proxy can even hold types of higher kinds,
>>>Proxy :: Proxy EitherProxy
>>>Proxy :: Proxy FunctorProxy
>>>Proxy :: Proxy complicatedStructureProxy
Constructors
| Proxy |
Instances
| Generic1 (Proxy :: k -> Type) | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Contravariant (Proxy :: Type -> Type) | |
| Representable (Proxy :: Type -> Type) | |
| ToJSON1 (Proxy :: Type -> Type) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Proxy a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Proxy a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Proxy a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Proxy a] -> Encoding # | |
| FromJSON1 (Proxy :: Type -> Type) | |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Eq1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Ord1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| NFData1 (Proxy :: Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 (Proxy :: Type -> Type) | |
Defined in Data.Hashable.Class | |
| Apply (Proxy :: Type -> Type) | |
| Bind (Proxy :: Type -> Type) | |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Data t => Data (Proxy t) | Since: base-4.7.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # | |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Generic (Proxy t) | |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
| ToJSON (Proxy a) | |
Defined in Data.Aeson.Types.ToJSON | |
| FromJSON (Proxy a) | |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| type Rep1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| type Rep (Proxy :: Type -> Type) | |
| type Rep (Proxy t) | Since: base-4.6.0.0 |
fromString :: IsString a => String -> a #
undefined :: HasCallStack => a #
undefined that leaves a warning in code on every usage.